Boltzmann Samplers for the Random Generation of Combinatorial Structures
نویسندگان
چکیده
PHIL IPPE DUCHON, PHIL IPPE FLAJOLET, GUY LOUCHARD and GILLES SCHAEFFER 1 LaBRI, Université de Bordeaux I, 351 Cours de la Libération, F-33405 Talence Cedex, France (e-mail: [email protected]) 2 Algorithms Project, INRIA-Rocquencourt, F-78153 Le Chesnay, France (e-mail: [email protected]) 3 Université Libre de Bruxelles, Département d’informatique, Boulevard du Triomphe, B-1050 Bruxelles, Belgique (e-mail: [email protected]) 4 Laboratoire d’Informatique (LIX), École Polytechnique, 91128 Palaiseau Cedex, France (e-mail: [email protected])
منابع مشابه
Boltzmann samplers for random generation of lambda terms
Randomly generating structured objects is important in testing and optimizing functional programs, whereas generating random λ-terms is more specifically needed for testing and optimizing compilers. For that a tool called QuickCheck has been proposed, but in this tool the control of the random generation is left to the programmer. Ten years ago, a method called Boltzmann samplers has been propo...
متن کاملBoltzmann Oracle for Combinatorial Systems
The recent discovery of Boltzmann samplers by Duchon, Flajolet, Louchard and Schaeffer [5] brought a considerable progress to the area of random generation of combinatorial structures. For wide families of classes of structures defined recursively, it is possible to construct automatically efficient random generators (samplers). These generators can produce large structures with the property th...
متن کاملBoltzmann sampling of ordered structures
Boltzmann models from statistical physics combined with methods from analytic combinatorics give rise to efficient algorithms for the random generation of combinatorials objects. This paper proposes an efficient sampler which satisfies the Boltzmann model principle for ordered structures. This goal is achieved using a special operator, named box operator. Under an abstract real-arithmetic compu...
متن کاملBoltzmann samplers for first-order differential specifications
In the framework of analytic combinatorics, Boltzmann models give rise to efficient algorithms for the random generation of combinatorial objects. This paper proposes an efficient Boltzmann sampler for ordered structures defined by first-order differential specifications. Under an abstract real-arithmetic computation model, our algorithm is of linear complexity for free generation; in addition,...
متن کاملPolynomial tuning of multiparametric combinatorial samplers
Boltzmann samplers and the recursive method are prominent algorithmic frameworks for the approximate-size and exact-size random generation of large combinatorial structures, such as maps, tilings, RNA sequences or various tree-like structures. In their multiparametric variants, these samplers allow to control the profile of expected values corresponding to multiple combinatorial parameters. One...
متن کاملAnalytic Samplers and the Combinatorial Rejection Method
Boltzmann samplers, introduced by Duchon et al. in 2001, make it possible to uniformly draw approximate size objects from any class which can be specified through the symbolic method. This, through by evaluating the associated generating functions to obtain the correct branching probabilities. But these samplers require generating functions, in particular in the neighborhood of their sunglarity...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 13 شماره
صفحات -
تاریخ انتشار 2004